<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html lang="en">
<head>
<title>Source code</title>
<link rel="stylesheet" type="text/css" href="../../../../../stylesheet.css" title="Style">
</head>
<body>
<div class="sourceContainer">
<pre><span class="sourceLineNo">001</span>/*<a name="line.1"></a>
<span class="sourceLineNo">002</span> * Copyright (C) 2010 Zhenya Leonov<a name="line.2"></a>
<span class="sourceLineNo">003</span> *<a name="line.3"></a>
<span class="sourceLineNo">004</span> * Licensed under the Apache License, Version 2.0 (the "License");<a name="line.4"></a>
<span class="sourceLineNo">005</span> * you may not use this file except in compliance with the License.<a name="line.5"></a>
<span class="sourceLineNo">006</span> * You may obtain a copy of the License at<a name="line.6"></a>
<span class="sourceLineNo">007</span> *<a name="line.7"></a>
<span class="sourceLineNo">008</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.8"></a>
<span class="sourceLineNo">009</span> *<a name="line.9"></a>
<span class="sourceLineNo">010</span> * Unless required by applicable law or agreed to in writing, software<a name="line.10"></a>
<span class="sourceLineNo">011</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.11"></a>
<span class="sourceLineNo">012</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.12"></a>
<span class="sourceLineNo">013</span> * See the License for the specific language governing permissions and<a name="line.13"></a>
<span class="sourceLineNo">014</span> * limitations under the License.<a name="line.14"></a>
<span class="sourceLineNo">015</span> */<a name="line.15"></a>
<span class="sourceLineNo">016</span><a name="line.16"></a>
<span class="sourceLineNo">017</span>package com.palamida.util.collect;<a name="line.17"></a>
<span class="sourceLineNo">018</span><a name="line.18"></a>
<span class="sourceLineNo">019</span>import static com.google.common.base.Preconditions.checkNotNull;<a name="line.19"></a>
<span class="sourceLineNo">020</span>import static com.google.common.base.Preconditions.checkState;<a name="line.20"></a>
<span class="sourceLineNo">021</span>import static com.palamida.util.collect.TreeSet.Color.BLACK;<a name="line.21"></a>
<span class="sourceLineNo">022</span>import static com.palamida.util.collect.TreeSet.Color.RED;<a name="line.22"></a>
<span class="sourceLineNo">023</span><a name="line.23"></a>
<span class="sourceLineNo">024</span>import java.io.Serializable;<a name="line.24"></a>
<span class="sourceLineNo">025</span>import java.util.AbstractSet;<a name="line.25"></a>
<span class="sourceLineNo">026</span>import java.util.Collection;<a name="line.26"></a>
<span class="sourceLineNo">027</span>import java.util.Comparator;<a name="line.27"></a>
<span class="sourceLineNo">028</span>import java.util.ConcurrentModificationException;<a name="line.28"></a>
<span class="sourceLineNo">029</span>import java.util.Iterator;<a name="line.29"></a>
<span class="sourceLineNo">030</span>import java.util.NavigableSet;<a name="line.30"></a>
<span class="sourceLineNo">031</span>import java.util.NoSuchElementException;<a name="line.31"></a>
<span class="sourceLineNo">032</span>import java.util.PriorityQueue;<a name="line.32"></a>
<span class="sourceLineNo">033</span>import java.util.SortedSet;<a name="line.33"></a>
<span class="sourceLineNo">034</span><a name="line.34"></a>
<span class="sourceLineNo">035</span>import com.google.common.collect.Iterables;<a name="line.35"></a>
<span class="sourceLineNo">036</span>import com.google.common.collect.MinMaxPriorityQueue;<a name="line.36"></a>
<span class="sourceLineNo">037</span>import com.google.common.collect.Ordering;<a name="line.37"></a>
<span class="sourceLineNo">038</span><a name="line.38"></a>
<span class="sourceLineNo">039</span>/**<a name="line.39"></a>
<span class="sourceLineNo">040</span> * &lt;b&gt;Note: This class should only be used for testing. It provides no practical<a name="line.40"></a>
<span class="sourceLineNo">041</span> * benefit when compared to {@link java.util.TreeSet java.util.TreeSet} and<a name="line.41"></a>
<span class="sourceLineNo">042</span> * lacks navigation methods defined in the {@link NavigableSet} interface.&lt;/b&gt;<a name="line.42"></a>
<span class="sourceLineNo">043</span> * &lt;p&gt;<a name="line.43"></a>
<span class="sourceLineNo">044</span> * A {@code Set} implementation based on a modified &lt;a<a name="line.44"></a>
<span class="sourceLineNo">045</span> * href="http://en.wikipedia.org/wiki/Red-black_tree"&gt;Red-Black Tree&lt;/a&gt;.<a name="line.45"></a>
<span class="sourceLineNo">046</span> * Elements are sorted from &lt;i&gt;least&lt;/i&gt; to &lt;i&gt;greatest&lt;/i&gt; according to their<a name="line.46"></a>
<span class="sourceLineNo">047</span> * &lt;i&gt;natural ordering&lt;/i&gt;, or by an explicit {@link Comparator} provided at<a name="line.47"></a>
<span class="sourceLineNo">048</span> * creation. Attempting to remove or insert {@code null} elements is prohibited.<a name="line.48"></a>
<span class="sourceLineNo">049</span> * Querying for {@code null} elements is allowed. Inserting non-comparable<a name="line.49"></a>
<span class="sourceLineNo">050</span> * elements will result in a {@code ClassCastException}.<a name="line.50"></a>
<span class="sourceLineNo">051</span> * &lt;p&gt;<a name="line.51"></a>
<span class="sourceLineNo">052</span> * The iterators obtained from the {@link #iterator()} method are<a name="line.52"></a>
<span class="sourceLineNo">053</span> * &lt;i&gt;fail-fast&lt;/i&gt;. Attempts to modify the elements in this list at any time<a name="line.53"></a>
<span class="sourceLineNo">054</span> * after an iterator is created, in any way except through the iterator's own<a name="line.54"></a>
<span class="sourceLineNo">055</span> * remove method, will result in a {@code ConcurrentModificationException}.<a name="line.55"></a>
<span class="sourceLineNo">056</span> * &lt;p&gt;<a name="line.56"></a>
<span class="sourceLineNo">057</span> * This set is not &lt;i&gt;thread-safe&lt;/i&gt;. If multiple threads modify this set<a name="line.57"></a>
<span class="sourceLineNo">058</span> * concurrently it must be synchronized externally.<a name="line.58"></a>
<span class="sourceLineNo">059</span> * &lt;p&gt;<a name="line.59"></a>
<span class="sourceLineNo">060</span> * This implementation uses a comparator (whether or not one is explicitly<a name="line.60"></a>
<span class="sourceLineNo">061</span> * provided) to perform all element comparisons. Two elements which are deemed<a name="line.61"></a>
<span class="sourceLineNo">062</span> * equal by the comparator's {@code compare(E, E)} method are, from the<a name="line.62"></a>
<span class="sourceLineNo">063</span> * standpoint of this set, equal.<a name="line.63"></a>
<span class="sourceLineNo">064</span> * &lt;p&gt;<a name="line.64"></a>
<span class="sourceLineNo">065</span> * The underlying Red-Black Tree provides the following worst case running time<a name="line.65"></a>
<span class="sourceLineNo">066</span> * (where &lt;i&gt;n&lt;/i&gt; is the size of this set and &lt;i&gt;m&lt;/i&gt; is the size of the<a name="line.66"></a>
<span class="sourceLineNo">067</span> * specified collection which is iterable in linear time):<a name="line.67"></a>
<span class="sourceLineNo">068</span> * &lt;p&gt;<a name="line.68"></a>
<span class="sourceLineNo">069</span> * &lt;table border="1" cellpadding="3" cellspacing="1" style="width:400px;"&gt;<a name="line.69"></a>
<span class="sourceLineNo">070</span> *   &lt;tr&gt;<a name="line.70"></a>
<span class="sourceLineNo">071</span> *     &lt;th style="text-align:center;"&gt;Method&lt;/th&gt;<a name="line.71"></a>
<span class="sourceLineNo">072</span> *     &lt;th style="text-align:center;"&gt;Running Time&lt;/th&gt;<a name="line.72"></a>
<span class="sourceLineNo">073</span> *   &lt;/tr&gt;<a name="line.73"></a>
<span class="sourceLineNo">074</span> *   &lt;tr&gt;<a name="line.74"></a>
<span class="sourceLineNo">075</span> *     &lt;td&gt;<a name="line.75"></a>
<span class="sourceLineNo">076</span> *       {@link #addAll(Collection) addAll(Collection)}&lt;br/&gt;<a name="line.76"></a>
<span class="sourceLineNo">077</span> *       {@link #containsAll(Collection) containsAll(Collection)}&lt;br/&gt;<a name="line.77"></a>
<span class="sourceLineNo">078</span> *       {@link #retainAll(Collection) retainAll(Collection)}&lt;br/&gt;<a name="line.78"></a>
<span class="sourceLineNo">079</span> *       {@link #removeAll(Collection) removeAll(Collection)}<a name="line.79"></a>
<span class="sourceLineNo">080</span> *     &lt;/td&gt;<a name="line.80"></a>
<span class="sourceLineNo">081</span> *     &lt;td style="text-align:center;"&gt;&lt;i&gt;O(m log n)&lt;/i&gt;&lt;/td&gt;<a name="line.81"></a>
<span class="sourceLineNo">082</span> *   &lt;/tr&gt;<a name="line.82"></a>
<span class="sourceLineNo">083</span> *   &lt;tr&gt;<a name="line.83"></a>
<span class="sourceLineNo">084</span> *     &lt;td&gt;<a name="line.84"></a>
<span class="sourceLineNo">085</span> *       {@link #add(Object) add(E)}&lt;br/&gt;<a name="line.85"></a>
<span class="sourceLineNo">086</span> *       {@link #contains(Object)}&lt;br/&gt;<a name="line.86"></a>
<span class="sourceLineNo">087</span> *       {@link #remove(Object)}<a name="line.87"></a>
<span class="sourceLineNo">088</span> *     &lt;/td&gt;<a name="line.88"></a>
<span class="sourceLineNo">089</span> *     &lt;td style="text-align:center;"&gt;&lt;i&gt;O(log n)&lt;/i&gt;&lt;/td&gt;<a name="line.89"></a>
<span class="sourceLineNo">090</span> *   &lt;/tr&gt;<a name="line.90"></a>
<span class="sourceLineNo">091</span> *   &lt;tr&gt;<a name="line.91"></a>
<span class="sourceLineNo">092</span> *     &lt;td&gt;<a name="line.92"></a>
<span class="sourceLineNo">093</span> *       {@link #clear() clear()}&lt;br/&gt;<a name="line.93"></a>
<span class="sourceLineNo">094</span> *       {@link #isEmpty() isEmpty()}&lt;br/&gt;<a name="line.94"></a>
<span class="sourceLineNo">095</span> *       {@link #size()}&lt;br/&gt;<a name="line.95"></a>
<span class="sourceLineNo">096</span> *       {@link Iterator#remove()}<a name="line.96"></a>
<span class="sourceLineNo">097</span> *     &lt;/td&gt;<a name="line.97"></a>
<span class="sourceLineNo">098</span> *     &lt;td style="text-align:center;"&gt;&lt;i&gt;O(1)&lt;/i&gt;&lt;/td&gt;<a name="line.98"></a>
<span class="sourceLineNo">099</span> *   &lt;/tr&gt;<a name="line.99"></a>
<span class="sourceLineNo">100</span> * &lt;/table&gt;<a name="line.100"></a>
<span class="sourceLineNo">101</span> * <a name="line.101"></a>
<span class="sourceLineNo">102</span> * @author Zhenya Leonov<a name="line.102"></a>
<span class="sourceLineNo">103</span> * @param &lt;E&gt;<a name="line.103"></a>
<span class="sourceLineNo">104</span> *            the type of elements maintained by this list<a name="line.104"></a>
<span class="sourceLineNo">105</span> * @see SkiplistSet<a name="line.105"></a>
<span class="sourceLineNo">106</span> */<a name="line.106"></a>
<span class="sourceLineNo">107</span>final public class TreeSet&lt;E&gt; extends AbstractSet&lt;E&gt; implements SortedCollection&lt;E&gt;, Cloneable, Serializable {<a name="line.107"></a>
<span class="sourceLineNo">108</span><a name="line.108"></a>
<span class="sourceLineNo">109</span>        private static final long serialVersionUID = 1L;<a name="line.109"></a>
<span class="sourceLineNo">110</span>        private transient int size = 0, modCount = 0;<a name="line.110"></a>
<span class="sourceLineNo">111</span>        private transient Node nil = new Node();<a name="line.111"></a>
<span class="sourceLineNo">112</span>        private transient Node min = nil, root = nil;<a name="line.112"></a>
<span class="sourceLineNo">113</span>        private final Comparator&lt;? super E&gt; comparator;<a name="line.113"></a>
<span class="sourceLineNo">114</span><a name="line.114"></a>
<span class="sourceLineNo">115</span>        private TreeSet(final Comparator&lt;? super E&gt; comparator) {<a name="line.115"></a>
<span class="sourceLineNo">116</span>                this.comparator = comparator;<a name="line.116"></a>
<span class="sourceLineNo">117</span>        }<a name="line.117"></a>
<span class="sourceLineNo">118</span><a name="line.118"></a>
<span class="sourceLineNo">119</span>        /**<a name="line.119"></a>
<span class="sourceLineNo">120</span>         * Creates a new {@code TreeSet} that orders its elements according to their<a name="line.120"></a>
<span class="sourceLineNo">121</span>         * &lt;i&gt;natural ordering&lt;/i&gt;.<a name="line.121"></a>
<span class="sourceLineNo">122</span>         * <a name="line.122"></a>
<span class="sourceLineNo">123</span>         * @return a new {@code TreeSet} that orders its elements according to their<a name="line.123"></a>
<span class="sourceLineNo">124</span>         *         &lt;i&gt;natural ordering&lt;/i&gt;<a name="line.124"></a>
<span class="sourceLineNo">125</span>         */<a name="line.125"></a>
<span class="sourceLineNo">126</span>        public static &lt;E extends Comparable&lt;? super E&gt;&gt; TreeSet&lt;E&gt; create() {<a name="line.126"></a>
<span class="sourceLineNo">127</span>                return new TreeSet&lt;E&gt;(Ordering.natural());<a name="line.127"></a>
<span class="sourceLineNo">128</span>        }<a name="line.128"></a>
<span class="sourceLineNo">129</span><a name="line.129"></a>
<span class="sourceLineNo">130</span>        /**<a name="line.130"></a>
<span class="sourceLineNo">131</span>         * Creates a new {@code TreeSet} that uses the specified comparator to order<a name="line.131"></a>
<span class="sourceLineNo">132</span>         * its elements.<a name="line.132"></a>
<span class="sourceLineNo">133</span>         * <a name="line.133"></a>
<span class="sourceLineNo">134</span>         * @param comparator<a name="line.134"></a>
<span class="sourceLineNo">135</span>         *            the specified comparator<a name="line.135"></a>
<span class="sourceLineNo">136</span>         * @return a new {@code TreeSet} that uses the specified comparator to order<a name="line.136"></a>
<span class="sourceLineNo">137</span>         *         its elements<a name="line.137"></a>
<span class="sourceLineNo">138</span>         * <a name="line.138"></a>
<span class="sourceLineNo">139</span>         */<a name="line.139"></a>
<span class="sourceLineNo">140</span>        public static &lt;E&gt; TreeSet&lt;E&gt; create(final Comparator&lt;? super E&gt; comparator) {<a name="line.140"></a>
<span class="sourceLineNo">141</span>                checkNotNull(comparator);<a name="line.141"></a>
<span class="sourceLineNo">142</span>                return new TreeSet&lt;E&gt;(comparator);<a name="line.142"></a>
<span class="sourceLineNo">143</span>        }<a name="line.143"></a>
<span class="sourceLineNo">144</span><a name="line.144"></a>
<span class="sourceLineNo">145</span>        /**<a name="line.145"></a>
<span class="sourceLineNo">146</span>         * Creates a new {@code TreeSet} containing the specified initial elements.<a name="line.146"></a>
<span class="sourceLineNo">147</span>         * If {@code elements} is an instance of {@link SortedSet},<a name="line.147"></a>
<span class="sourceLineNo">148</span>         * {@link PriorityQueue}, {@link MinMaxPriorityQueue}, or<a name="line.148"></a>
<span class="sourceLineNo">149</span>         * {@code SortedCollection}, this set will be ordered according to the same<a name="line.149"></a>
<span class="sourceLineNo">150</span>         * ordering. Otherwise, this set will be ordered according to the &lt;i&gt;natural<a name="line.150"></a>
<span class="sourceLineNo">151</span>         * ordering&lt;/i&gt; of its elements.<a name="line.151"></a>
<span class="sourceLineNo">152</span>         * <a name="line.152"></a>
<span class="sourceLineNo">153</span>         * @param elements<a name="line.153"></a>
<span class="sourceLineNo">154</span>         *            the initial elements to be placed into the set<a name="line.154"></a>
<span class="sourceLineNo">155</span>         * @return a new {@code TreeSet} containing the specified initial elements<a name="line.155"></a>
<span class="sourceLineNo">156</span>         * @throws ClassCastException<a name="line.156"></a>
<span class="sourceLineNo">157</span>         *             if any of the initial elements cannot be compared to one<a name="line.157"></a>
<span class="sourceLineNo">158</span>         *             another according to this set's ordering<a name="line.158"></a>
<span class="sourceLineNo">159</span>         * @throws NullPointerException<a name="line.159"></a>
<span class="sourceLineNo">160</span>         *             if any of the initial elements or {@code elements} itself is<a name="line.160"></a>
<span class="sourceLineNo">161</span>         *             {@code null}<a name="line.161"></a>
<span class="sourceLineNo">162</span>         */<a name="line.162"></a>
<span class="sourceLineNo">163</span>        @SuppressWarnings({ "unchecked" })<a name="line.163"></a>
<span class="sourceLineNo">164</span>        public static &lt;E extends Comparable&lt;? super E&gt;&gt; TreeSet&lt;E&gt; create(final Iterable&lt;? extends E&gt; elements) {<a name="line.164"></a>
<span class="sourceLineNo">165</span>                checkNotNull(elements);<a name="line.165"></a>
<span class="sourceLineNo">166</span>                final Comparator&lt;? super E&gt; comparator;<a name="line.166"></a>
<span class="sourceLineNo">167</span>                if (elements instanceof SortedSet&lt;?&gt;)<a name="line.167"></a>
<span class="sourceLineNo">168</span>                        comparator = ((SortedSet&lt;? super E&gt;) elements).comparator();<a name="line.168"></a>
<span class="sourceLineNo">169</span>                else if (elements instanceof PriorityQueue&lt;?&gt;)<a name="line.169"></a>
<span class="sourceLineNo">170</span>                        comparator = ((PriorityQueue&lt;? super E&gt;) elements).comparator();<a name="line.170"></a>
<span class="sourceLineNo">171</span>                else if (elements instanceof SortedCollection&lt;?&gt;)<a name="line.171"></a>
<span class="sourceLineNo">172</span>                        comparator = ((SortedCollection&lt;? super E&gt;) elements).comparator();<a name="line.172"></a>
<span class="sourceLineNo">173</span>                else if (elements instanceof MinMaxPriorityQueue&lt;?&gt;)<a name="line.173"></a>
<span class="sourceLineNo">174</span>                        comparator = ((MinMaxPriorityQueue&lt;? super E&gt;) elements).comparator();<a name="line.174"></a>
<span class="sourceLineNo">175</span>                else<a name="line.175"></a>
<span class="sourceLineNo">176</span>                        comparator = (Comparator&lt;? super E&gt;) Ordering.natural();<a name="line.176"></a>
<span class="sourceLineNo">177</span>                final TreeSet&lt;E&gt; treeSet = TreeSet.create(comparator);<a name="line.177"></a>
<span class="sourceLineNo">178</span>                Iterables.addAll(treeSet, elements);<a name="line.178"></a>
<span class="sourceLineNo">179</span>                return treeSet;<a name="line.179"></a>
<span class="sourceLineNo">180</span>        }<a name="line.180"></a>
<span class="sourceLineNo">181</span><a name="line.181"></a>
<span class="sourceLineNo">182</span>        /**<a name="line.182"></a>
<span class="sourceLineNo">183</span>         * Returns the comparator used to order the elements in this set. If one was<a name="line.183"></a>
<span class="sourceLineNo">184</span>         * not explicitly provided a &lt;i&gt;natural order&lt;/i&gt; comparator is returned.<a name="line.184"></a>
<span class="sourceLineNo">185</span>         * <a name="line.185"></a>
<span class="sourceLineNo">186</span>         * @return the comparator used to order this set<a name="line.186"></a>
<span class="sourceLineNo">187</span>         */<a name="line.187"></a>
<span class="sourceLineNo">188</span>        @Override<a name="line.188"></a>
<span class="sourceLineNo">189</span>        public Comparator&lt;? super E&gt; comparator() {<a name="line.189"></a>
<span class="sourceLineNo">190</span>                return comparator;<a name="line.190"></a>
<span class="sourceLineNo">191</span>        }<a name="line.191"></a>
<span class="sourceLineNo">192</span><a name="line.192"></a>
<span class="sourceLineNo">193</span>        /**<a name="line.193"></a>
<span class="sourceLineNo">194</span>         * Inserts the specified element into this set in sorted order.<a name="line.194"></a>
<span class="sourceLineNo">195</span>         */<a name="line.195"></a>
<span class="sourceLineNo">196</span>        @Override<a name="line.196"></a>
<span class="sourceLineNo">197</span>        public boolean add(E e) {<a name="line.197"></a>
<span class="sourceLineNo">198</span>                return insert(new Node(checkNotNull(e)));<a name="line.198"></a>
<span class="sourceLineNo">199</span>        }<a name="line.199"></a>
<span class="sourceLineNo">200</span><a name="line.200"></a>
<span class="sourceLineNo">201</span>        @SuppressWarnings("unchecked")<a name="line.201"></a>
<span class="sourceLineNo">202</span>        @Override<a name="line.202"></a>
<span class="sourceLineNo">203</span>        public boolean contains(Object o) {<a name="line.203"></a>
<span class="sourceLineNo">204</span>                return o != null &amp;&amp; search((E) o) != null;<a name="line.204"></a>
<span class="sourceLineNo">205</span>        }<a name="line.205"></a>
<span class="sourceLineNo">206</span><a name="line.206"></a>
<span class="sourceLineNo">207</span>        @Override<a name="line.207"></a>
<span class="sourceLineNo">208</span>        public Iterator&lt;E&gt; iterator() {<a name="line.208"></a>
<span class="sourceLineNo">209</span>                return new Iterator&lt;E&gt;() {<a name="line.209"></a>
<span class="sourceLineNo">210</span>                        private Node next = min;<a name="line.210"></a>
<span class="sourceLineNo">211</span>                        private Node last = nil;<a name="line.211"></a>
<span class="sourceLineNo">212</span>                        private int expectedModCount = modCount;<a name="line.212"></a>
<span class="sourceLineNo">213</span><a name="line.213"></a>
<span class="sourceLineNo">214</span>                        @Override<a name="line.214"></a>
<span class="sourceLineNo">215</span>                        public boolean hasNext() {<a name="line.215"></a>
<span class="sourceLineNo">216</span>                                return next != nil;<a name="line.216"></a>
<span class="sourceLineNo">217</span>                        }<a name="line.217"></a>
<span class="sourceLineNo">218</span><a name="line.218"></a>
<span class="sourceLineNo">219</span>                        @Override<a name="line.219"></a>
<span class="sourceLineNo">220</span>                        public void remove() {<a name="line.220"></a>
<span class="sourceLineNo">221</span>                                checkForConcurrentModification();<a name="line.221"></a>
<span class="sourceLineNo">222</span>                                checkState(last != nil);<a name="line.222"></a>
<span class="sourceLineNo">223</span>                                if (last.left != nil &amp;&amp; last.right != nil)<a name="line.223"></a>
<span class="sourceLineNo">224</span>                                        next = last;<a name="line.224"></a>
<span class="sourceLineNo">225</span>                                delete(last);<a name="line.225"></a>
<span class="sourceLineNo">226</span>                                expectedModCount = modCount;<a name="line.226"></a>
<span class="sourceLineNo">227</span>                                last = nil;<a name="line.227"></a>
<span class="sourceLineNo">228</span>                        }<a name="line.228"></a>
<span class="sourceLineNo">229</span><a name="line.229"></a>
<span class="sourceLineNo">230</span>                        @Override<a name="line.230"></a>
<span class="sourceLineNo">231</span>                        public E next() {<a name="line.231"></a>
<span class="sourceLineNo">232</span>                                checkForConcurrentModification();<a name="line.232"></a>
<span class="sourceLineNo">233</span>                                if (next == nil)<a name="line.233"></a>
<span class="sourceLineNo">234</span>                                        throw new NoSuchElementException();<a name="line.234"></a>
<span class="sourceLineNo">235</span>                                last = next;<a name="line.235"></a>
<span class="sourceLineNo">236</span>                                next = successor(next);<a name="line.236"></a>
<span class="sourceLineNo">237</span>                                return last.element;<a name="line.237"></a>
<span class="sourceLineNo">238</span>                        }<a name="line.238"></a>
<span class="sourceLineNo">239</span><a name="line.239"></a>
<span class="sourceLineNo">240</span>                        private void checkForConcurrentModification() {<a name="line.240"></a>
<span class="sourceLineNo">241</span>                                if (modCount != expectedModCount)<a name="line.241"></a>
<span class="sourceLineNo">242</span>                                        throw new ConcurrentModificationException();<a name="line.242"></a>
<span class="sourceLineNo">243</span>                        }<a name="line.243"></a>
<span class="sourceLineNo">244</span>                };<a name="line.244"></a>
<span class="sourceLineNo">245</span>        }<a name="line.245"></a>
<span class="sourceLineNo">246</span><a name="line.246"></a>
<span class="sourceLineNo">247</span>        @SuppressWarnings("unchecked")<a name="line.247"></a>
<span class="sourceLineNo">248</span>        @Override<a name="line.248"></a>
<span class="sourceLineNo">249</span>        public boolean remove(Object o) {<a name="line.249"></a>
<span class="sourceLineNo">250</span>                final Node node = search((E) checkNotNull(o));<a name="line.250"></a>
<span class="sourceLineNo">251</span>                if (node == null)<a name="line.251"></a>
<span class="sourceLineNo">252</span>                        return false;<a name="line.252"></a>
<span class="sourceLineNo">253</span>                delete(node);<a name="line.253"></a>
<span class="sourceLineNo">254</span>                return true;<a name="line.254"></a>
<span class="sourceLineNo">255</span>        }<a name="line.255"></a>
<span class="sourceLineNo">256</span><a name="line.256"></a>
<span class="sourceLineNo">257</span>        @Override<a name="line.257"></a>
<span class="sourceLineNo">258</span>        public int size() {<a name="line.258"></a>
<span class="sourceLineNo">259</span>                return size;<a name="line.259"></a>
<span class="sourceLineNo">260</span>        }<a name="line.260"></a>
<span class="sourceLineNo">261</span><a name="line.261"></a>
<span class="sourceLineNo">262</span>        @Override<a name="line.262"></a>
<span class="sourceLineNo">263</span>        public void clear() {<a name="line.263"></a>
<span class="sourceLineNo">264</span>                modCount++;<a name="line.264"></a>
<span class="sourceLineNo">265</span>                root = min = nil;<a name="line.265"></a>
<span class="sourceLineNo">266</span>                size = 0;<a name="line.266"></a>
<span class="sourceLineNo">267</span>        }<a name="line.267"></a>
<span class="sourceLineNo">268</span><a name="line.268"></a>
<span class="sourceLineNo">269</span>        /**<a name="line.269"></a>
<span class="sourceLineNo">270</span>         * Returns a shallow copy of this {@code TreeSet}. The elements themselves<a name="line.270"></a>
<span class="sourceLineNo">271</span>         * are not cloned.<a name="line.271"></a>
<span class="sourceLineNo">272</span>         * <a name="line.272"></a>
<span class="sourceLineNo">273</span>         * @return a shallow copy of this queue<a name="line.273"></a>
<span class="sourceLineNo">274</span>         */<a name="line.274"></a>
<span class="sourceLineNo">275</span>        @SuppressWarnings("unchecked")<a name="line.275"></a>
<span class="sourceLineNo">276</span>        @Override<a name="line.276"></a>
<span class="sourceLineNo">277</span>        public TreeSet&lt;E&gt; clone() {<a name="line.277"></a>
<span class="sourceLineNo">278</span>                TreeSet&lt;E&gt; clone;<a name="line.278"></a>
<span class="sourceLineNo">279</span>                try {<a name="line.279"></a>
<span class="sourceLineNo">280</span>                        clone = (TreeSet&lt;E&gt;) super.clone();<a name="line.280"></a>
<span class="sourceLineNo">281</span>                } catch (CloneNotSupportedException e) {<a name="line.281"></a>
<span class="sourceLineNo">282</span>                        throw new InternalError();<a name="line.282"></a>
<span class="sourceLineNo">283</span>                }<a name="line.283"></a>
<span class="sourceLineNo">284</span>                clone.modCount = clone.size = 0;<a name="line.284"></a>
<span class="sourceLineNo">285</span>                clone.root = clone.min = clone.min = clone.nil = new Node();<a name="line.285"></a>
<span class="sourceLineNo">286</span>                clone.addAll(this);<a name="line.286"></a>
<span class="sourceLineNo">287</span>                return clone;<a name="line.287"></a>
<span class="sourceLineNo">288</span>        }<a name="line.288"></a>
<span class="sourceLineNo">289</span><a name="line.289"></a>
<span class="sourceLineNo">290</span>        private void writeObject(java.io.ObjectOutputStream oos) throws java.io.IOException {<a name="line.290"></a>
<span class="sourceLineNo">291</span>                oos.defaultWriteObject();<a name="line.291"></a>
<span class="sourceLineNo">292</span>                oos.writeInt(size);<a name="line.292"></a>
<span class="sourceLineNo">293</span>                for (E e : this)<a name="line.293"></a>
<span class="sourceLineNo">294</span>                        oos.writeObject(e);<a name="line.294"></a>
<span class="sourceLineNo">295</span>        }<a name="line.295"></a>
<span class="sourceLineNo">296</span><a name="line.296"></a>
<span class="sourceLineNo">297</span>        @SuppressWarnings("unchecked")<a name="line.297"></a>
<span class="sourceLineNo">298</span>        private void readObject(java.io.ObjectInputStream ois) throws java.io.IOException, ClassNotFoundException {<a name="line.298"></a>
<span class="sourceLineNo">299</span>                ois.defaultReadObject();<a name="line.299"></a>
<span class="sourceLineNo">300</span>                root = min = nil = new Node();<a name="line.300"></a>
<span class="sourceLineNo">301</span>                int size = ois.readInt();<a name="line.301"></a>
<span class="sourceLineNo">302</span>                for (int i = 0; i &lt; size; i++)<a name="line.302"></a>
<span class="sourceLineNo">303</span>                        add((E) ois.readObject());<a name="line.303"></a>
<span class="sourceLineNo">304</span>        }<a name="line.304"></a>
<span class="sourceLineNo">305</span><a name="line.305"></a>
<span class="sourceLineNo">306</span>        // Red-Black-Tree<a name="line.306"></a>
<span class="sourceLineNo">307</span><a name="line.307"></a>
<span class="sourceLineNo">308</span>        static enum Color {<a name="line.308"></a>
<span class="sourceLineNo">309</span>                BLACK, RED;<a name="line.309"></a>
<span class="sourceLineNo">310</span>        }<a name="line.310"></a>
<span class="sourceLineNo">311</span><a name="line.311"></a>
<span class="sourceLineNo">312</span>        private class Node {<a name="line.312"></a>
<span class="sourceLineNo">313</span>                private E element = null;<a name="line.313"></a>
<span class="sourceLineNo">314</span>                private Node parent, left, right;<a name="line.314"></a>
<span class="sourceLineNo">315</span>                private Color color = BLACK;<a name="line.315"></a>
<span class="sourceLineNo">316</span><a name="line.316"></a>
<span class="sourceLineNo">317</span>                private Node() {<a name="line.317"></a>
<span class="sourceLineNo">318</span>                        parent = right = left = this;<a name="line.318"></a>
<span class="sourceLineNo">319</span>                }<a name="line.319"></a>
<span class="sourceLineNo">320</span><a name="line.320"></a>
<span class="sourceLineNo">321</span>                private Node(final E element) {<a name="line.321"></a>
<span class="sourceLineNo">322</span>                        this.element = element;<a name="line.322"></a>
<span class="sourceLineNo">323</span>                        parent = right = left = nil;<a name="line.323"></a>
<span class="sourceLineNo">324</span>                }<a name="line.324"></a>
<span class="sourceLineNo">325</span>        }<a name="line.325"></a>
<span class="sourceLineNo">326</span><a name="line.326"></a>
<span class="sourceLineNo">327</span>        private Node search(final E e) {<a name="line.327"></a>
<span class="sourceLineNo">328</span>                Node n = root;<a name="line.328"></a>
<span class="sourceLineNo">329</span>                while (n != nil) {<a name="line.329"></a>
<span class="sourceLineNo">330</span>                        int cmp = comparator.compare(e, n.element);<a name="line.330"></a>
<span class="sourceLineNo">331</span>                        if (cmp == 0)<a name="line.331"></a>
<span class="sourceLineNo">332</span>                                return n;<a name="line.332"></a>
<span class="sourceLineNo">333</span>                        if (cmp &lt; 0)<a name="line.333"></a>
<span class="sourceLineNo">334</span>                                n = n.left;<a name="line.334"></a>
<span class="sourceLineNo">335</span>                        else<a name="line.335"></a>
<span class="sourceLineNo">336</span>                                n = n.right;<a name="line.336"></a>
<span class="sourceLineNo">337</span>                }<a name="line.337"></a>
<span class="sourceLineNo">338</span>                return null;<a name="line.338"></a>
<span class="sourceLineNo">339</span>        }<a name="line.339"></a>
<span class="sourceLineNo">340</span><a name="line.340"></a>
<span class="sourceLineNo">341</span>        /**<a name="line.341"></a>
<span class="sourceLineNo">342</span>         * Introduction to Algorithms (CLR) Second Edition<a name="line.342"></a>
<span class="sourceLineNo">343</span>         * <a name="line.343"></a>
<span class="sourceLineNo">344</span>         * &lt;pre&gt;<a name="line.344"></a>
<span class="sourceLineNo">345</span>         * RB-INSERT(T, z)<a name="line.345"></a>
<span class="sourceLineNo">346</span>         * y = nil[T]<a name="line.346"></a>
<span class="sourceLineNo">347</span>         * x = root[T]<a name="line.347"></a>
<span class="sourceLineNo">348</span>         * while x != nil[T]<a name="line.348"></a>
<span class="sourceLineNo">349</span>         *    do y = x<a name="line.349"></a>
<span class="sourceLineNo">350</span>         *       if key[z] &lt; key[x]<a name="line.350"></a>
<span class="sourceLineNo">351</span>         *          then x = left[x]<a name="line.351"></a>
<span class="sourceLineNo">352</span>         *          else x = right[x]<a name="line.352"></a>
<span class="sourceLineNo">353</span>         * p[z] = y<a name="line.353"></a>
<span class="sourceLineNo">354</span>         * if y = nil[T]<a name="line.354"></a>
<span class="sourceLineNo">355</span>         *    then root[T] = z<a name="line.355"></a>
<span class="sourceLineNo">356</span>         *    else if key[z] &lt; key[y]<a name="line.356"></a>
<span class="sourceLineNo">357</span>         *            then left[y] = z<a name="line.357"></a>
<span class="sourceLineNo">358</span>         *            else right[y] = z<a name="line.358"></a>
<span class="sourceLineNo">359</span>         * left[z] = nil[T]<a name="line.359"></a>
<span class="sourceLineNo">360</span>         * right[z] = nil[T]<a name="line.360"></a>
<span class="sourceLineNo">361</span>         * color[z] = RED<a name="line.361"></a>
<span class="sourceLineNo">362</span>         * RB-INSERT-FIXUP(T, z)<a name="line.362"></a>
<span class="sourceLineNo">363</span>         */<a name="line.363"></a>
<span class="sourceLineNo">364</span>        private boolean insert(Node z) {<a name="line.364"></a>
<span class="sourceLineNo">365</span>                size++;<a name="line.365"></a>
<span class="sourceLineNo">366</span>                modCount++;<a name="line.366"></a>
<span class="sourceLineNo">367</span>                Node x = root;<a name="line.367"></a>
<span class="sourceLineNo">368</span>                Node y = nil;<a name="line.368"></a>
<span class="sourceLineNo">369</span>                while (x != nil) {<a name="line.369"></a>
<span class="sourceLineNo">370</span>                        y = x;<a name="line.370"></a>
<span class="sourceLineNo">371</span>                        int cmp = comparator.compare(z.element, x.element);<a name="line.371"></a>
<span class="sourceLineNo">372</span>                        if (cmp == 0)<a name="line.372"></a>
<span class="sourceLineNo">373</span>                                return false;<a name="line.373"></a>
<span class="sourceLineNo">374</span>                        else if (cmp &lt; 0)<a name="line.374"></a>
<span class="sourceLineNo">375</span>                                x = x.left;<a name="line.375"></a>
<span class="sourceLineNo">376</span>                        else<a name="line.376"></a>
<span class="sourceLineNo">377</span>                                x = x.right;<a name="line.377"></a>
<span class="sourceLineNo">378</span>                }<a name="line.378"></a>
<span class="sourceLineNo">379</span>                z.parent = y;<a name="line.379"></a>
<span class="sourceLineNo">380</span>                if (y == nil)<a name="line.380"></a>
<span class="sourceLineNo">381</span>                        root = z;<a name="line.381"></a>
<span class="sourceLineNo">382</span>                else if (comparator.compare(z.element, y.element) &lt; 0)<a name="line.382"></a>
<span class="sourceLineNo">383</span>                        y.left = z;<a name="line.383"></a>
<span class="sourceLineNo">384</span>                else<a name="line.384"></a>
<span class="sourceLineNo">385</span>                        y.right = z;<a name="line.385"></a>
<span class="sourceLineNo">386</span>                fixAfterInsertion(z);<a name="line.386"></a>
<span class="sourceLineNo">387</span>                if (min == nil || comparator.compare(z.element, min.element) &lt; 0)<a name="line.387"></a>
<span class="sourceLineNo">388</span>                        min = z;<a name="line.388"></a>
<span class="sourceLineNo">389</span>                return true;<a name="line.389"></a>
<span class="sourceLineNo">390</span>        }<a name="line.390"></a>
<span class="sourceLineNo">391</span><a name="line.391"></a>
<span class="sourceLineNo">392</span>        /**<a name="line.392"></a>
<span class="sourceLineNo">393</span>         * Introduction to Algorithms (CLR) Second Edition<a name="line.393"></a>
<span class="sourceLineNo">394</span>         * <a name="line.394"></a>
<span class="sourceLineNo">395</span>         * &lt;pre&gt;<a name="line.395"></a>
<span class="sourceLineNo">396</span>         * RB-DELETE-FIXUP(T, z)<a name="line.396"></a>
<span class="sourceLineNo">397</span>         * if left[z] = nil[T] or right[z] = nil[T]<a name="line.397"></a>
<span class="sourceLineNo">398</span>         *    then y = z<a name="line.398"></a>
<span class="sourceLineNo">399</span>         *    else y = TREE-SUCCESSOR(z)<a name="line.399"></a>
<span class="sourceLineNo">400</span>         * if left[y] != nil[T]<a name="line.400"></a>
<span class="sourceLineNo">401</span>         *    then x = left[y]<a name="line.401"></a>
<span class="sourceLineNo">402</span>         *    else x = right[y]<a name="line.402"></a>
<span class="sourceLineNo">403</span>         * p[x] = p[y]<a name="line.403"></a>
<span class="sourceLineNo">404</span>         * if p[y] = nil[T]<a name="line.404"></a>
<span class="sourceLineNo">405</span>         *    then root[T] = x<a name="line.405"></a>
<span class="sourceLineNo">406</span>         *    else if y = left[p[y]]<a name="line.406"></a>
<span class="sourceLineNo">407</span>         *            then left[p[y]] = x<a name="line.407"></a>
<span class="sourceLineNo">408</span>         *            else right[p[y]] = x<a name="line.408"></a>
<span class="sourceLineNo">409</span>         * if y != z<a name="line.409"></a>
<span class="sourceLineNo">410</span>         *    then key[z] = key[y]<a name="line.410"></a>
<span class="sourceLineNo">411</span>         *         copy y's satellite data into z<a name="line.411"></a>
<span class="sourceLineNo">412</span>         * if color[y] = BLACK<a name="line.412"></a>
<span class="sourceLineNo">413</span>         *    then RB-DELETE-FIXUP(T, x)<a name="line.413"></a>
<span class="sourceLineNo">414</span>         * return y<a name="line.414"></a>
<span class="sourceLineNo">415</span>         */<a name="line.415"></a>
<span class="sourceLineNo">416</span>        private void delete(Node z) {<a name="line.416"></a>
<span class="sourceLineNo">417</span>                size--;<a name="line.417"></a>
<span class="sourceLineNo">418</span>                modCount++;<a name="line.418"></a>
<span class="sourceLineNo">419</span>                Node x, y;<a name="line.419"></a>
<span class="sourceLineNo">420</span>                if (min == z)<a name="line.420"></a>
<span class="sourceLineNo">421</span>                        min = successor(z);<a name="line.421"></a>
<span class="sourceLineNo">422</span>                if (z.left == nil || z.right == nil)<a name="line.422"></a>
<span class="sourceLineNo">423</span>                        y = z;<a name="line.423"></a>
<span class="sourceLineNo">424</span>                else<a name="line.424"></a>
<span class="sourceLineNo">425</span>                        y = successor(z);<a name="line.425"></a>
<span class="sourceLineNo">426</span>                if (y.left != nil)<a name="line.426"></a>
<span class="sourceLineNo">427</span>                        x = y.left;<a name="line.427"></a>
<span class="sourceLineNo">428</span>                else<a name="line.428"></a>
<span class="sourceLineNo">429</span>                        x = y.right;<a name="line.429"></a>
<span class="sourceLineNo">430</span>                x.parent = y.parent;<a name="line.430"></a>
<span class="sourceLineNo">431</span>                if (y.parent == nil)<a name="line.431"></a>
<span class="sourceLineNo">432</span>                        root = x;<a name="line.432"></a>
<span class="sourceLineNo">433</span>                else if (y == y.parent.left)<a name="line.433"></a>
<span class="sourceLineNo">434</span>                        y.parent.left = x;<a name="line.434"></a>
<span class="sourceLineNo">435</span>                else<a name="line.435"></a>
<span class="sourceLineNo">436</span>                        y.parent.right = x;<a name="line.436"></a>
<span class="sourceLineNo">437</span>                if (y != z)<a name="line.437"></a>
<span class="sourceLineNo">438</span>                        z.element = y.element;<a name="line.438"></a>
<span class="sourceLineNo">439</span>                if (y.color == Color.BLACK)<a name="line.439"></a>
<span class="sourceLineNo">440</span>                        fixAfterDeletion(x);<a name="line.440"></a>
<span class="sourceLineNo">441</span>        }<a name="line.441"></a>
<span class="sourceLineNo">442</span><a name="line.442"></a>
<span class="sourceLineNo">443</span>        /**<a name="line.443"></a>
<span class="sourceLineNo">444</span>         * Introduction to Algorithms (CLR) Second Edition<a name="line.444"></a>
<span class="sourceLineNo">445</span>         * <a name="line.445"></a>
<span class="sourceLineNo">446</span>         * &lt;pre&gt;<a name="line.446"></a>
<span class="sourceLineNo">447</span>         * TREE-SUCCESSOR(x)<a name="line.447"></a>
<span class="sourceLineNo">448</span>         * if right[x] != NIL<a name="line.448"></a>
<span class="sourceLineNo">449</span>         *    then return TREE-MINIMUM(right[x])<a name="line.449"></a>
<span class="sourceLineNo">450</span>         * y = p[x]<a name="line.450"></a>
<span class="sourceLineNo">451</span>         * while y != NIL and x = right[y]<a name="line.451"></a>
<span class="sourceLineNo">452</span>         *    do x = y<a name="line.452"></a>
<span class="sourceLineNo">453</span>         *       y = p[y]<a name="line.453"></a>
<span class="sourceLineNo">454</span>         * return y<a name="line.454"></a>
<span class="sourceLineNo">455</span>         */<a name="line.455"></a>
<span class="sourceLineNo">456</span>        private Node successor(Node x) {<a name="line.456"></a>
<span class="sourceLineNo">457</span>                if (x == nil)<a name="line.457"></a>
<span class="sourceLineNo">458</span>                        return nil;<a name="line.458"></a>
<span class="sourceLineNo">459</span>                if (x.right != nil) {<a name="line.459"></a>
<span class="sourceLineNo">460</span>                        Node y = x.right;<a name="line.460"></a>
<span class="sourceLineNo">461</span>                        while (y.left != nil)<a name="line.461"></a>
<span class="sourceLineNo">462</span>                                y = y.left;<a name="line.462"></a>
<span class="sourceLineNo">463</span>                        return y;<a name="line.463"></a>
<span class="sourceLineNo">464</span>                }<a name="line.464"></a>
<span class="sourceLineNo">465</span>                Node y = x.parent;<a name="line.465"></a>
<span class="sourceLineNo">466</span>                while (y != nil &amp;&amp; x == y.right) {<a name="line.466"></a>
<span class="sourceLineNo">467</span>                        x = y;<a name="line.467"></a>
<span class="sourceLineNo">468</span>                        y = y.parent;<a name="line.468"></a>
<span class="sourceLineNo">469</span>                }<a name="line.469"></a>
<span class="sourceLineNo">470</span>                return y;<a name="line.470"></a>
<span class="sourceLineNo">471</span>        }<a name="line.471"></a>
<span class="sourceLineNo">472</span><a name="line.472"></a>
<span class="sourceLineNo">473</span>        /**<a name="line.473"></a>
<span class="sourceLineNo">474</span>         * Introduction to Algorithms (CLR) Second Edition<a name="line.474"></a>
<span class="sourceLineNo">475</span>         * <a name="line.475"></a>
<span class="sourceLineNo">476</span>         * &lt;pre&gt;<a name="line.476"></a>
<span class="sourceLineNo">477</span>         * LEFT-ROTATE(T, x)<a name="line.477"></a>
<span class="sourceLineNo">478</span>         * y = right[x]                                                 Set y.<a name="line.478"></a>
<span class="sourceLineNo">479</span>         * right[x] = left[y]                                   Turn y's left subtree into x's right subtree.<a name="line.479"></a>
<span class="sourceLineNo">480</span>         * if left[y] != nil[T]<a name="line.480"></a>
<span class="sourceLineNo">481</span>         *    then p[left[y]] = x<a name="line.481"></a>
<span class="sourceLineNo">482</span>         * p[y] = p[x]                                                  Link x's parent to y.<a name="line.482"></a>
<span class="sourceLineNo">483</span>         * if p[x] = nil[T]<a name="line.483"></a>
<span class="sourceLineNo">484</span>         *    then root[T] = y<a name="line.484"></a>
<span class="sourceLineNo">485</span>         *    else if x = left[p[x]]<a name="line.485"></a>
<span class="sourceLineNo">486</span>         *            then left[p[x]] = y<a name="line.486"></a>
<span class="sourceLineNo">487</span>         *            else right[p[x]] = y<a name="line.487"></a>
<span class="sourceLineNo">488</span>         * left[y] = x                                                  Put x on y's left.<a name="line.488"></a>
<span class="sourceLineNo">489</span>         * p[x] = y<a name="line.489"></a>
<span class="sourceLineNo">490</span>         */<a name="line.490"></a>
<span class="sourceLineNo">491</span>        private void leftRotate(final Node x) {<a name="line.491"></a>
<span class="sourceLineNo">492</span>                if (x != nil) {<a name="line.492"></a>
<span class="sourceLineNo">493</span>                        Node n = x.right;<a name="line.493"></a>
<span class="sourceLineNo">494</span>                        x.right = n.left;<a name="line.494"></a>
<span class="sourceLineNo">495</span>                        if (n.left != nil)<a name="line.495"></a>
<span class="sourceLineNo">496</span>                                n.left.parent = x;<a name="line.496"></a>
<span class="sourceLineNo">497</span>                        n.parent = x.parent;<a name="line.497"></a>
<span class="sourceLineNo">498</span>                        if (x.parent == nil)<a name="line.498"></a>
<span class="sourceLineNo">499</span>                                root = n;<a name="line.499"></a>
<span class="sourceLineNo">500</span>                        else if (x.parent.left == x)<a name="line.500"></a>
<span class="sourceLineNo">501</span>                                x.parent.left = n;<a name="line.501"></a>
<span class="sourceLineNo">502</span>                        else<a name="line.502"></a>
<span class="sourceLineNo">503</span>                                x.parent.right = n;<a name="line.503"></a>
<span class="sourceLineNo">504</span>                        n.left = x;<a name="line.504"></a>
<span class="sourceLineNo">505</span>                        x.parent = n;<a name="line.505"></a>
<span class="sourceLineNo">506</span>                }<a name="line.506"></a>
<span class="sourceLineNo">507</span>        }<a name="line.507"></a>
<span class="sourceLineNo">508</span><a name="line.508"></a>
<span class="sourceLineNo">509</span>        private void rightRotate(final Node x) {<a name="line.509"></a>
<span class="sourceLineNo">510</span>                if (x != nil) {<a name="line.510"></a>
<span class="sourceLineNo">511</span>                        Node n = x.left;<a name="line.511"></a>
<span class="sourceLineNo">512</span>                        x.left = n.right;<a name="line.512"></a>
<span class="sourceLineNo">513</span>                        if (n.right != nil)<a name="line.513"></a>
<span class="sourceLineNo">514</span>                                n.right.parent = x;<a name="line.514"></a>
<span class="sourceLineNo">515</span>                        n.parent = x.parent;<a name="line.515"></a>
<span class="sourceLineNo">516</span>                        if (x.parent == nil)<a name="line.516"></a>
<span class="sourceLineNo">517</span>                                root = n;<a name="line.517"></a>
<span class="sourceLineNo">518</span>                        else if (x.parent.right == x)<a name="line.518"></a>
<span class="sourceLineNo">519</span>                                x.parent.right = n;<a name="line.519"></a>
<span class="sourceLineNo">520</span>                        else<a name="line.520"></a>
<span class="sourceLineNo">521</span>                                x.parent.left = n;<a name="line.521"></a>
<span class="sourceLineNo">522</span>                        n.right = x;<a name="line.522"></a>
<span class="sourceLineNo">523</span>                        x.parent = n;<a name="line.523"></a>
<span class="sourceLineNo">524</span>                }<a name="line.524"></a>
<span class="sourceLineNo">525</span>        }<a name="line.525"></a>
<span class="sourceLineNo">526</span><a name="line.526"></a>
<span class="sourceLineNo">527</span>        /**<a name="line.527"></a>
<span class="sourceLineNo">528</span>         * Introduction to Algorithms (CLR) Second Edition<a name="line.528"></a>
<span class="sourceLineNo">529</span>         * <a name="line.529"></a>
<span class="sourceLineNo">530</span>         * &lt;pre&gt;<a name="line.530"></a>
<span class="sourceLineNo">531</span>         * RB-INSERT-FIXUP(T, z)<a name="line.531"></a>
<span class="sourceLineNo">532</span>         * while color[p[z]] = RED<a name="line.532"></a>
<span class="sourceLineNo">533</span>         *    do if p[z] = left[p[p[z]]]<a name="line.533"></a>
<span class="sourceLineNo">534</span>         *          then y = right[p[p[z]]]<a name="line.534"></a>
<span class="sourceLineNo">535</span>         *               if color[y] = RED<a name="line.535"></a>
<span class="sourceLineNo">536</span>         *                  then color[p[z]] = BLACK                                    Case 1<a name="line.536"></a>
<span class="sourceLineNo">537</span>         *                       color[y] = BLACK                                               Case 1 <a name="line.537"></a>
<span class="sourceLineNo">538</span>         *                       color[p[p[z]]] = RED                                   Case 1<a name="line.538"></a>
<span class="sourceLineNo">539</span>         *                       z = p[p[z]]                                                    Case 1<a name="line.539"></a>
<span class="sourceLineNo">540</span>         *                  else if z = right[p[z]]<a name="line.540"></a>
<span class="sourceLineNo">541</span>         *                          then z = p[z]                                               Case 2<a name="line.541"></a>
<span class="sourceLineNo">542</span>         *                               LEFT-ROTATE(T, z)                              Case 2<a name="line.542"></a>
<span class="sourceLineNo">543</span>         *                       color[p[z]] = BLACK                                    Case 3<a name="line.543"></a>
<span class="sourceLineNo">544</span>         *                       color[p[p[z]]] = RED                                   Case 3<a name="line.544"></a>
<span class="sourceLineNo">545</span>         *                       RIGHT-ROTATE(T, p[p[z]])                               Case 3<a name="line.545"></a>
<span class="sourceLineNo">546</span>         *          else (same as then clause<a name="line.546"></a>
<span class="sourceLineNo">547</span>         *                        with right and left exchanged)<a name="line.547"></a>
<span class="sourceLineNo">548</span>         * color[root[T]] = BLACK<a name="line.548"></a>
<span class="sourceLineNo">549</span>         */<a name="line.549"></a>
<span class="sourceLineNo">550</span>        private void fixAfterInsertion(Node z) {<a name="line.550"></a>
<span class="sourceLineNo">551</span>                z.color = RED;<a name="line.551"></a>
<span class="sourceLineNo">552</span>                while (z.parent.color == RED) {<a name="line.552"></a>
<span class="sourceLineNo">553</span>                        if (z.parent == z.parent.parent.left) {<a name="line.553"></a>
<span class="sourceLineNo">554</span>                                Node y = z.parent.parent.right;<a name="line.554"></a>
<span class="sourceLineNo">555</span>                                if (y.color == RED) {<a name="line.555"></a>
<span class="sourceLineNo">556</span>                                        z.parent.color = BLACK;<a name="line.556"></a>
<span class="sourceLineNo">557</span>                                        y.color = BLACK;<a name="line.557"></a>
<span class="sourceLineNo">558</span>                                        z.parent.parent.color = RED;<a name="line.558"></a>
<span class="sourceLineNo">559</span>                                        z = z.parent.parent;<a name="line.559"></a>
<span class="sourceLineNo">560</span>                                } else {<a name="line.560"></a>
<span class="sourceLineNo">561</span>                                        if (z == z.parent.right) {<a name="line.561"></a>
<span class="sourceLineNo">562</span>                                                z = z.parent;<a name="line.562"></a>
<span class="sourceLineNo">563</span>                                                leftRotate(z);<a name="line.563"></a>
<span class="sourceLineNo">564</span>                                        }<a name="line.564"></a>
<span class="sourceLineNo">565</span>                                        z.parent.color = BLACK;<a name="line.565"></a>
<span class="sourceLineNo">566</span>                                        z.parent.parent.color = RED;<a name="line.566"></a>
<span class="sourceLineNo">567</span>                                        rightRotate(z.parent.parent);<a name="line.567"></a>
<span class="sourceLineNo">568</span>                                }<a name="line.568"></a>
<span class="sourceLineNo">569</span>                        } else {<a name="line.569"></a>
<span class="sourceLineNo">570</span>                                Node y = z.parent.parent.left;<a name="line.570"></a>
<span class="sourceLineNo">571</span>                                if (y.color == RED) {<a name="line.571"></a>
<span class="sourceLineNo">572</span>                                        z.parent.color = BLACK;<a name="line.572"></a>
<span class="sourceLineNo">573</span>                                        y.color = BLACK;<a name="line.573"></a>
<span class="sourceLineNo">574</span>                                        z.parent.parent.color = RED;<a name="line.574"></a>
<span class="sourceLineNo">575</span>                                        z = z.parent.parent;<a name="line.575"></a>
<span class="sourceLineNo">576</span>                                } else {<a name="line.576"></a>
<span class="sourceLineNo">577</span>                                        if (z == z.parent.left) {<a name="line.577"></a>
<span class="sourceLineNo">578</span>                                                z = z.parent;<a name="line.578"></a>
<span class="sourceLineNo">579</span>                                                rightRotate(z);<a name="line.579"></a>
<span class="sourceLineNo">580</span>                                        }<a name="line.580"></a>
<span class="sourceLineNo">581</span>                                        z.parent.color = BLACK;<a name="line.581"></a>
<span class="sourceLineNo">582</span>                                        z.parent.parent.color = RED;<a name="line.582"></a>
<span class="sourceLineNo">583</span>                                        leftRotate(z.parent.parent);<a name="line.583"></a>
<span class="sourceLineNo">584</span>                                }<a name="line.584"></a>
<span class="sourceLineNo">585</span>                        }<a name="line.585"></a>
<span class="sourceLineNo">586</span>                }<a name="line.586"></a>
<span class="sourceLineNo">587</span>                root.color = BLACK;<a name="line.587"></a>
<span class="sourceLineNo">588</span>        }<a name="line.588"></a>
<span class="sourceLineNo">589</span><a name="line.589"></a>
<span class="sourceLineNo">590</span>        /**<a name="line.590"></a>
<span class="sourceLineNo">591</span>         * Introduction to Algorithms (CLR) Second Edition<a name="line.591"></a>
<span class="sourceLineNo">592</span>         * <a name="line.592"></a>
<span class="sourceLineNo">593</span>         * &lt;pre&gt;<a name="line.593"></a>
<span class="sourceLineNo">594</span>         * RB-DELETE-FIXUP(T, x)<a name="line.594"></a>
<span class="sourceLineNo">595</span>         * while x != root[T] and color[x] = BLACK<a name="line.595"></a>
<span class="sourceLineNo">596</span>         *    do if x = left[p[x]]<a name="line.596"></a>
<span class="sourceLineNo">597</span>         *          then w = right[p[x]]<a name="line.597"></a>
<span class="sourceLineNo">598</span>         *               if color[w] = RED<a name="line.598"></a>
<span class="sourceLineNo">599</span>         *                  then color[w] = BLACK                                                               Case 1<a name="line.599"></a>
<span class="sourceLineNo">600</span>         *                       color[p[x]] = RED                                                              Case 1<a name="line.600"></a>
<span class="sourceLineNo">601</span>         *                       LEFT-ROTATE(T, p[x])                                                   Case 1<a name="line.601"></a>
<span class="sourceLineNo">602</span>         *                       w = right[p[x]]                                                                Case 1<a name="line.602"></a>
<span class="sourceLineNo">603</span>         *               if color[left[w]] = BLACK and color[right[w]] = BLACK<a name="line.603"></a>
<span class="sourceLineNo">604</span>         *                  then color[w] = RED                                                                 Case 2<a name="line.604"></a>
<span class="sourceLineNo">605</span>         *                       x = p[x]                                                                               Case 2<a name="line.605"></a>
<span class="sourceLineNo">606</span>         *                  else if color[right[w]] = BLACK<a name="line.606"></a>
<span class="sourceLineNo">607</span>         *                          then color[left[w]] = BLACK                                 Case 3<a name="line.607"></a>
<span class="sourceLineNo">608</span>         *                               color[w] = RED                                                 Case 3<a name="line.608"></a>
<span class="sourceLineNo">609</span>         *                               RIGHT-ROTATE(T,w)                                              Case 3<a name="line.609"></a>
<span class="sourceLineNo">610</span>         *                               w = right[p[x]]                                                Case 3<a name="line.610"></a>
<span class="sourceLineNo">611</span>         *                       color[w] = color[p[x]]                                                 Case 4<a name="line.611"></a>
<span class="sourceLineNo">612</span>         *                       color[p[x]] = BLACK                                                    Case 4<a name="line.612"></a>
<span class="sourceLineNo">613</span>         *                       color[right[w]] = BLACK                                                Case 4<a name="line.613"></a>
<span class="sourceLineNo">614</span>         *                       LEFT-ROTATE(T, p[x])                                                   Case 4<a name="line.614"></a>
<span class="sourceLineNo">615</span>         *                       x = root[T]                                                                    Case 4<a name="line.615"></a>
<span class="sourceLineNo">616</span>         *          else (same as then clause with right and left exchanged)<a name="line.616"></a>
<span class="sourceLineNo">617</span>         * color[x] = BLACK<a name="line.617"></a>
<span class="sourceLineNo">618</span>         */<a name="line.618"></a>
<span class="sourceLineNo">619</span>        private void fixAfterDeletion(Node x) {<a name="line.619"></a>
<span class="sourceLineNo">620</span>                while (x != root &amp;&amp; x.color == BLACK) {<a name="line.620"></a>
<span class="sourceLineNo">621</span>                        if (x == x.parent.left) {<a name="line.621"></a>
<span class="sourceLineNo">622</span>                                Node w = x.parent.right;<a name="line.622"></a>
<span class="sourceLineNo">623</span>                                if (w.color == RED) {<a name="line.623"></a>
<span class="sourceLineNo">624</span>                                        w.color = BLACK;<a name="line.624"></a>
<span class="sourceLineNo">625</span>                                        x.parent.color = RED;<a name="line.625"></a>
<span class="sourceLineNo">626</span>                                        leftRotate(x.parent);<a name="line.626"></a>
<span class="sourceLineNo">627</span>                                        w = x.parent.right;<a name="line.627"></a>
<span class="sourceLineNo">628</span>                                }<a name="line.628"></a>
<span class="sourceLineNo">629</span>                                if (w.left.color == BLACK &amp;&amp; w.right.color == BLACK) {<a name="line.629"></a>
<span class="sourceLineNo">630</span>                                        w.color = RED;<a name="line.630"></a>
<span class="sourceLineNo">631</span>                                        x = x.parent;<a name="line.631"></a>
<span class="sourceLineNo">632</span>                                } else {<a name="line.632"></a>
<span class="sourceLineNo">633</span>                                        if (w.right.color == BLACK) {<a name="line.633"></a>
<span class="sourceLineNo">634</span>                                                w.left.color = BLACK;<a name="line.634"></a>
<span class="sourceLineNo">635</span>                                                w.color = RED;<a name="line.635"></a>
<span class="sourceLineNo">636</span>                                                rightRotate(w);<a name="line.636"></a>
<span class="sourceLineNo">637</span>                                                w = x.parent.right;<a name="line.637"></a>
<span class="sourceLineNo">638</span>                                        }<a name="line.638"></a>
<span class="sourceLineNo">639</span>                                        w.color = x.parent.color;<a name="line.639"></a>
<span class="sourceLineNo">640</span>                                        x.parent.color = BLACK;<a name="line.640"></a>
<span class="sourceLineNo">641</span>                                        w.right.color = BLACK;<a name="line.641"></a>
<span class="sourceLineNo">642</span>                                        leftRotate(x.parent);<a name="line.642"></a>
<span class="sourceLineNo">643</span>                                        x = root;<a name="line.643"></a>
<span class="sourceLineNo">644</span>                                }<a name="line.644"></a>
<span class="sourceLineNo">645</span>                        } else {<a name="line.645"></a>
<span class="sourceLineNo">646</span>                                Node w = x.parent.left;<a name="line.646"></a>
<span class="sourceLineNo">647</span>                                if (w.color == RED) {<a name="line.647"></a>
<span class="sourceLineNo">648</span>                                        w.color = BLACK;<a name="line.648"></a>
<span class="sourceLineNo">649</span>                                        x.parent.color = RED;<a name="line.649"></a>
<span class="sourceLineNo">650</span>                                        rightRotate(w.parent);<a name="line.650"></a>
<span class="sourceLineNo">651</span>                                        w = x.parent.left;<a name="line.651"></a>
<span class="sourceLineNo">652</span>                                }<a name="line.652"></a>
<span class="sourceLineNo">653</span>                                if (w.right.color == BLACK &amp;&amp; w.left.color == BLACK) {<a name="line.653"></a>
<span class="sourceLineNo">654</span>                                        w.color = RED;<a name="line.654"></a>
<span class="sourceLineNo">655</span>                                        x = x.parent;<a name="line.655"></a>
<span class="sourceLineNo">656</span>                                } else {<a name="line.656"></a>
<span class="sourceLineNo">657</span>                                        if (w.left.color == BLACK) {<a name="line.657"></a>
<span class="sourceLineNo">658</span>                                                w.right.color = BLACK;<a name="line.658"></a>
<span class="sourceLineNo">659</span>                                                w.color = RED;<a name="line.659"></a>
<span class="sourceLineNo">660</span>                                                leftRotate(w);<a name="line.660"></a>
<span class="sourceLineNo">661</span>                                                w = x.parent.left;<a name="line.661"></a>
<span class="sourceLineNo">662</span>                                        }<a name="line.662"></a>
<span class="sourceLineNo">663</span>                                        w.color = x.parent.color;<a name="line.663"></a>
<span class="sourceLineNo">664</span>                                        w.parent.color = BLACK;<a name="line.664"></a>
<span class="sourceLineNo">665</span>                                        w.left.color = BLACK;<a name="line.665"></a>
<span class="sourceLineNo">666</span>                                        rightRotate(x.parent);<a name="line.666"></a>
<span class="sourceLineNo">667</span>                                        x = root;<a name="line.667"></a>
<span class="sourceLineNo">668</span>                                }<a name="line.668"></a>
<span class="sourceLineNo">669</span>                        }<a name="line.669"></a>
<span class="sourceLineNo">670</span>                }<a name="line.670"></a>
<span class="sourceLineNo">671</span>                x.color = BLACK;<a name="line.671"></a>
<span class="sourceLineNo">672</span>        }<a name="line.672"></a>
<span class="sourceLineNo">673</span><a name="line.673"></a>
<span class="sourceLineNo">674</span>}<a name="line.674"></a>




























































</pre>
</div>
</body>
</html>
